Characterization of $(2m,m)$-Paintable Graphs
نویسندگان
چکیده
منابع مشابه
Characterization of $(2m, m)$-Paintable Graphs
In this paper, we prove that for any graph G and any positive integer m, G is (2m,m)-paintable if and only if G is 2-paintable. It was asked by Zhu in 2009 whether k-paintable graphs are (km,m)-paintable for any positive integer m. Our result answers this question in the affirmative for k = 2.
متن کاملPaintable Battery
If the components of a battery, including electrodes, separator, electrolyte and the current collectors can be designed as paints and applied sequentially to build a complete battery, on any arbitrary surface, it would have significant impact on the design, implementation and integration of energy storage devices. Here, we establish a paradigm change in battery assembly by fabricating rechargea...
متن کاملProgramming a Paintable Computer
A paintable computer is defined as an agglomerate of numerous, finely dispersed, ultra-miniaturized computing particles; each positioned randomly, running asynchronously and communicating locally. Individual particles are tightly resource bound, and processing is necessarily distributed. Yet computing elements are vanishingly cheap and are regarded as freely expendable. In this regime, a limiti...
متن کاملPaintable band-edge liquid crystal lasers.
In this paper we demonstrate photonic band-edge laser emission from emulsion-based polymer dispersed liquid crystals. The lasing medium consists of dye-doped chiral nematic droplets dispersed within a polymer matrix that spontaneously align as the film dries. Such lasers can be easily formed on single substrates with no alignment layers. The system combines the self-organizing periodic structur...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/3876